منابع مشابه
Deeper Inside PageRank
This paper serves as a companion or extension to the “Inside PageRank” paper by Bianchini et al. [Bianchini et al. 03]. It is a comprehensive survey of all issues associated with PageRank, covering the basic PageRank model, available and recommended solution methods, storage issues, existence, uniqueness, and convergence properties, possible alterations to the basic model, suggested alternative...
متن کاملA Deeper Investigation of PageRank as a Function of the Damping Factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spreads uniformly part of the rank. The choice of α is eminently empirical, and in most cases the original suggestion α = 0.85 by Brin and Page is still used. In this paper, we give a mathematical analysis of PageRank when α...
متن کاملTurning Hepatic Cancer Stem Cells Inside Out – A Deeper Understanding through Multiple Perspectives
Hepatocellular carcinoma (HCC), a highly malignant disease and the third leading cause of all cancer mortalities worldwide, often responses poorly to current treatments and results in dismal outcomes due to frequent chemoresistance and tumor relapse. The heterogeneity of HCC is an important attribute of the disease. It is the outcome of many factors, including the cross-talk between tumor cells...
متن کاملMultiplex PageRank
Many complex systems can be described as multiplex networks in which the same nodes can interact with one another in different layers, thus forming a set of interacting and co-evolving networks. Examples of such multiplex systems are social networks where people are involved in different types of relationships and interact through various forms of communication media. The ranking of nodes in mu...
متن کاملMultilinear PageRank
In this paper, we first extend the celebrated PageRank modification to a higher-order Markov chain. Although this system has attractive theoretical properties, it is computationally intractable for many interesting problems. We next study a computationally tractable approximation to the higher-order PageRank vector that involves a system of polynomial equations called multilinear PageRank. This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2004
ISSN: 1542-7951
DOI: 10.1080/15427951.2004.10129091